Remarks on Generalized Post Correspondence Problem
نویسندگان
چکیده
It is shown that Post Correspondence Problem remains undecidable even in the case where one of the morphisms is xed. Accordingly the generalized PCP is undecidable even in the case where both of the morphisms are xed, and, moreover, the cardinality of their domain alphabet is 7. In particular, GPCP(7) is undecidable. On the other hand, GPCP(2) is not only decidable, but, as we show here, its all solutions can be eeectively found.
منابع مشابه
Some Remarks on Generalized Sequence Space of Bounded Variation of Sequences of Fuzzy Numbers
The idea of difference sequences of real (or complex) numbers was introducedby Ki zmaz cite{Kizmaz}. In this paper, using the difference operator and alacunary sequence, we introduce and examine the class of sequence $bv_{theta}left( Delta,mathcal{F}right) .$ We study some of its properties likesolidity, symmetricity, etc.
متن کاملRemarks on the Paper ``Coupled Fixed Point Theorems for Single-Valued Operators in b-Metric Spaces''
In this paper, we improve some recent coupled fixed point resultsfor single-valued operators in the framework of ordered $b$-metricspaces established by Bota et al. [M-F. Bota, A. Petrusel, G.Petrusel and B. Samet, Coupled fixed point theorems forsingle-valued operators in b-metric spaces, Fixed Point TheoryAppl. (2015) 2015:231]. Also, we prove that Perov-type fix...
متن کاملProblem is in P TUCS Technical Report
We show that the binary (generalized) Post Correspondence Problem is decidable in polynomial time. We also give a characterization of morphisms with stable suffix complexity.
متن کاملThe (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable
متن کامل
Binary (generalized) Post Correspondence Problem
We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by Ehrenfeucht, Karhum8 aki and Rozenberg. Our proof is complete and somewhat shorter than the original proof although we use the same basic idea. c © 2002 Elsevier Science B.V. All rights reserved.
متن کامل